Corrigendum to “Incidence coloring on hypercubes” [Theoret. Comput. Sci. 557 (2014) 59–65]
نویسندگان
چکیده
منابع مشابه
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]
In [4] we put in relation graphs with Dilworth number at most two and the two classes LPG and mLPG. In order to prove this relation, we have heavily exploited a result we deduced from [1]. We have now realized that this result is not always true, so in this corrigendum we correctly restate the result concerning the relation between graphs with Dilworth number at most two and the two classes of ...
متن کاملErratum to "The computational power of Benenson automata" [Theoret. Comput. Sci. 344 (2005) 279-297]
We erroneously claim that Lemma 5.1 applies to both non-deterministic and deterministic Benenson automata, while it applies only to deterministic ones. The following corrected lemma holds for both deterministic and non-deterministic Benenson automata. It also exponentially improves on the dependence on D for both for circuit depth and size compared to the paper version. Note that compared with ...
متن کاملErratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160]
We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over -categories: 9nite product categories with canonical structure. Constraint information is directly built-in to the notion of signature via categorical syntax. Many-sorted equational constraints are a special case of the formalism which combines feature...
متن کاملCorrigendum to "Ordering based on implications" [Inform. Sci. 276(2014) 377-386]
Article history: Available online 9 June 2014
متن کاملCorrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]
Article history: Received 8 February 2010 Available online 11 March 2010 H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009) [3]. In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is aga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.08.001